Defining syntax-directed translations by tree bimorphisms

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited

Quasi-alphabetic tree bimorphisms [Steinby and Tîrn uc : Syntax-Directed Translations and Quasi-Alphabetic Tree Bimorphisms. Proc. CIAA, LNCS 4783:265 276, 2007] are reconsidered. It is known that the class of (string) translations de ned by such bimorphisms coincides with the class of syntax-directed translations. This result is extended to a smaller class of tree bimorphisms namely (linear an...

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms

Properties of quasi-alphabetic tree bimorphisms

We study the class of quasi-alphabetic relations, i.e., tree transformations de ned by tree bimorphisms (';L; ) with '; quasi-alphabetic tree homomorphisms and L a regular tree language. We present a canonical representation of these relations; as an immediate consequence, we get the closure under union. Also, we show that they are not closed under intersection and complement, and do not preser...

Properties of Quasi-Relabeling Tree Bimorphisms

The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (φ,L, ψ), where φ and ψ are quasi-relabeling tree homomorphisms and L is a regular tree language. Such relations admit a canonical representation, which immediately also yields that QUASI is closed under nite union. Howe...

Document Transformation Based on Syntax-directed Tree Translation

We present a description system for transformation of structured documents based on Context Free Grammars (CFGs). The system caters to transformations between different document class descriptions, and is presented mainly in terms of logical structure transformation. Two requirements for transformation are proposed: the output document class must be explicitly representable, and inconsistency m...